Binary Trees for Dependence Structure
نویسندگان
چکیده
منابع مشابه
Structure Sharing with Binary Trees
Problem: proliferation of copies When words are combined to form phrases, unification is not applied to lexlcat representations directly because it would result in the lexicon being changed. When a word is encountered in a text, a copy is made of its entry, and unification is applied to the copied graph, not the original one. In fact, unification in a typical parser is always preceded by a copy...
متن کاملBinary Queries for Document Trees
Motivated by XML applications, we address the problem of answering k-ary queries, i.e. simultaneously locating k nodes of an input tree as specified by a given relation. In particular, we discuss how binary queries can be used as a means of navigation in XML document transformations. We introduce a grammar-based approach to specifying k-ary queries. An efficient tree-automata based implementati...
متن کاملCharacteristic Inequalities for Binary Trees
In a binary tree T of N leaves, the left (right) level l i (r i) of leaf i is the number of left (right) edges in path from the root to that leaf. The level n i of leaf i is n i = l i +r i. Kraft-McMillan's characteristic inequality gives a necessary and suucient condition for a multiset of integers fn 1 ; n 2 ; :::; n N g to be the length ensemble of a binary tree T. Similarly, Yeung's charact...
متن کاملSegregated Binary Trees: Address-Ordered Binary Trees Revisited
Dynamic memory management has been an active research area for the last four decades. The primary goals of any memory management technique are the speed of allocation & delloaction; and efficient storage utilization. In this paper, we introduce two new memory allocation techniques: Address Ordered Binary Trees (ABT) and Segregated Binary Trees (SBT). Our empirical results show how Address Order...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3017529